Soundness of workflow nets: classification, decidability, and analysis

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interval Soundness of Resource-Constrained Workflow Nets: Decidability and Repair

Correctness of workflow design cannot be evaluated by checking the execution for one single instance of the workflow, because instances, even when being independent from the data perspective, depend on each other with respect to the resources they rely on for executing tasks. The resources are shared among the instances of the same workflow; moreover, other workflows can use the same resources....

متن کامل

Soundness of Workflow Nets with Reset Arcs

Petri nets are often used to model and analyze workflows. Many workflow languages have been mapped onto Petri nets in order to provide formal semantics or to verify correctness properties. Typically, the so-called Workflow nets are used to model and analyze workflows and variants of the classical soundness property are used as a correctness notion. Since many workflow languages have cancelation...

متن کامل

Visualizing the Soundness of Workflow Nets

Petri nets and in particular workflow nets as a process description language allow the application of formal verification methods, e.g., to prove soundness. Although tools for soundness checks do already exist , it is still difficult for the workflow designer to correct the process model according to the output of these tests – mostly because diagnostic messages are not directly linked to the g...

متن کامل

Structural soundness of workflow nets is decidable

The problem of deciding whether a given workflow net is k-sound for some k 1 is known as structural soundness. We prove that structural soundness of workflow nets is decidable.  2005 Elsevier B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Formal Aspects of Computing

سال: 2010

ISSN: 0934-5043,1433-299X

DOI: 10.1007/s00165-010-0161-4